Burnside-chromatic polynomials of group-invariant graphs
نویسندگان
چکیده
منابع مشابه
Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملChromatic polynomials of random graphs
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009New J. Phys. 11 023001) nowmake it possible to compute chromatic polynomia...
متن کاملChromatic polynomials and toroidal graphs
The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly. The method, known as ‘bracelet theory’ is based on a decomposition in terms of representations of the symmetric group. The results are particularly appropriate for studying the limit curves of the chromatic roots of these families. In this paper these techniques are applied to a family of quadra...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملInjective Chromatic Sum and Injective Chromatic Polynomials of Graphs
The injective chromatic number χi(G) [5] of a graph G is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. In this paper we define injective chromatic sum and injective strength of a graph and obtain the injective chromatic sum of complete graph, paths, cycles, wheel graph and complete bipartite graph. We a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2020
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2385